Sets of elements that pairwise generate a linear group
نویسندگان
چکیده
منابع مشابه
Sets of elements that pairwise generate a linear group
Let G be any of the groups (P )GL(n, q), (P )SL(n, q). Define a (simple) graph Γ = Γ(G) on the set of elements of G by connecting two vertices by an edge if and only if they generate G. We prove that if the dimension n is at least 12 and not congruent to 2 modulo 4, then the maximum size of a complete subgraph in Γ is equal to the chromatic number of Γ. This work was motivated by a question of ...
متن کاملSets of permutations that generate the symmetric group pairwise
The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1 + 1 permutations having this property. For all sufficiently large integers n with n≡ 2 mod 4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. The...
متن کاملCorrigendum to "Sets of elements that pairwise generate a linear group" [J. Combin. Theory Ser. A 115 (3) (2008) 442-465]
a Department of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK b School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK c Department of Mathematics, University of Southern California, Los Angeles, CA 90089-2532, USA d DPMMS, Centre for Mathematical Sciences, University of Cambridge, Cambridge CB3 0BW, UK e Alfréd Rényi Insti...
متن کاملA generalization of the probability that the commutator of two group elements is equal to a given element
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with combinatorial techniques. Here we illustrate that a wider context may be considered and show some structural restrictions on the group.
متن کاملconjugate $p$-elements of full support that generate the wreath product $c_{p}wr c_{p}$
for a symmetric group $g:=sym(n)$ and a conjugacy class $mathcal{x}$ of involutions in $g$, it is known that if the class of involutions does not have a unique fixed point, then - with a few small exceptions - given two elements $a,x in mathcal{x}$, either $angbrac{a,x}$ is isomorphic to the dihedral group $d_{8}$, or there is a further element $y in mathcal{x}$ such that $angbrac{a,y} cong ang...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2008
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2007.07.002